温度/应变/扭曲三参量同时测量低成本传感系统

提出了一种利用布喇格光纤光栅反射光作信号源、高频CO2激光脉冲写入的长周期光纤光栅和超周期光纤光栅作传感器实现温度、应变和扭曲同时测量的全光栅型低成本强度解调传感方案.文中利用长周期光纤光栅边缘滤波效应实现了温度、应变和扭曲传感信号的实时解调.实验结果表明，其温度和应变的测量灵敏度分别为－0.211 dB/℃和－0.012 dB/10με；而扭曲率的测量灵敏度为0.4394 dB/(rad·m－1)，是该法写入普通LPFG的4倍以上.     

Approximation algorithms for dynamic resource allocation

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

Economic Equilibrium: Optimality and Price Decentralization

Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies.     

Regular population monotonic allocation schemes

The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets.     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.     

作业成本法数学模型的创新

随着企业产品价格竞争愈演愈烈，成本的合理分配、计算日显重要，但在间接费用的分摊上，传统成本会计对成本信息反映失真的局限性日益显露，会计理论界和实务界开始寻求一种新的准确的成本计算方法，作业成本法应运而生。本将由作业成本法基本原理推导出其数学模型，并将对其数学模型进一步改进，建立比较数学模型。使作业成本法向实际应用更进一步。     

上市公司资本成本面板数据模型与实证分析

本文利用我国上市公司1997至2002年的有关财务数据,建立了我国上市公司资本成本面板数据模型,运用该模型分析了我国上市公司资本成本与财务杠杆、企业规模的关系.结果表明,财务杠杆的提升、企业规模的扩大将使资本成本下降.该结论对我国上市公司优化资本结构、提高企业价值具有一定的参考价值.     

Allocating electricity transmission costs through tracing: a game-theoretic rationale

Tracing is a method of assigning flows in an electricity network to particular generators and loads, assuming perfect mixing at each node. It can be used to assign costs to transmission users. We show that the resulting allocation is equal to the Shapley value of an equivalent co-operative game.     

工程施工中运输网络优化方案

施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 .